Neural Networks and Rational à Lukasiewicz Logic
نویسندگان
چکیده
In this paper we shall describe a correspondence between Rational à Lukasiewicz formulas and neural networks in which the activation function is the truncated identity and synaptic weights are rational numbers. On one hand to have a logical representation (in a given logic) of neural networks could widen the interpretability, amalgamability and reuse of these objects. On the other hand, neural networks could be used to learn formulas from data and as circuital counterparts of (functions represented by) formulas.
منابع مشابه
Reverse Engineering and Symbolic Knowledge Extraction on Łukasiewicz Fuzzy Logics using Linear Neural Networks
This work describes a methodology to combine logic-based systems and connectionist systems. Our approach uses finite truth valued Lukasiewicz logic, where we take advantage of fact, presented by Castro in [6], what in this type of logics every connective can be define by a neuron in an artificial network having by activation function the identity truncated to zero and one. This allowed the inje...
متن کاملSymbolic Knowledge Extraction using Łukasiewicz Logics
This work describes a methodology that combines logic-based systems and connectionist systems. Our approach uses finite truth-valued Lukasiewicz logic, wherein every connective can be defined by a neuron in an artificial network [1]. This allowed the injection of first-order formulas into a network architecture, and also simplified symbolic rule extraction. For that we trained a neural networks...
متن کاملImplicit definability of truth constants in Łukasiewicz logic
In the framework of propositional Lukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly defining each of the rational elements in the standard semantics are explored, and based on that, a faithful interpretation of theories in Rational Pavelka logic ...
متن کامل{\L}ukasiewicz {\mu}-calculus
The paper explores properties of the Lukasiewicz μ-calculus, or Lμ for short, an extension of Lukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe that Lμ terms, with n variables, define monotone piecewise linear functions from [0, 1]n to [0, 1]. Two effective procedures for calculating the output of Lμ terms on rational i...
متن کاملSOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کامل